Search results for "model [interaction]"
showing 10 items of 1495 documents
A Bryce and cossey type theorem in a class of locally finite groups
2001
In this paper the subgroup-closed saturated Fitting formations of radical locally finite groups with min-p for all p are fully characterised. Moreover the study of a class of generalised nilpotent groups introduced by Ballester-Bolinches and Pedraza is continued.
Guaranteed error bounds and local indicators for adaptive solvers using stabilised space–time IgA approximations to parabolic problems
2019
Abstract The paper is concerned with space–time IgA approximations to parabolic initial–boundary value problems. We deduce guaranteed and fully computable error bounds adapted to special features of such type of approximations and investigate their efficiency. The derivation of error estimates is based on the analysis of the corresponding integral identity and exploits purely functional arguments in the maximal parabolic regularity setting. The estimates are valid for any approximation from the admissible (energy) class and do not contain mesh-dependent constants. They provide computable and fully guaranteed error bounds for the norms arising in stabilised space–time approximations. Further…
Models of Computation, Riemann Hypothesis, and Classical Mathematics
1998
Classical mathematics is a source of ideas used by Computer Science since the very first days. Surprisingly, there is still much to be found. Computer scientists, especially, those in Theoretical Computer Science find inspiring ideas both in old notions and results, and in the 20th century mathematics. The latest decades have brought us evidence that computer people will soon study quantum physics and modern biology just to understand what computers are doing.
Singular solutions to p-Laplacian type equations
1999
We construct singular solutions to equations $div\mathcal{A}(x,\nabla u) = 0,$ similar to the p-Laplacian, that tend to ∞ on a given closed set of p-capacity zero. Moreover, we show that every Gδ-set of vanishing p-capacity is the infinity set of some A-superharmonic function.
A cognitive architecture for inner speech
2020
Abstract A cognitive architecture for inner speech is presented. It is based on the Standard Model of Mind, integrated with modules for self-talking. Briefly, the working memory of the proposed architecture includes the phonological loop as a component which manages the exchanging information between the phonological store and the articulatory control system. The inner dialogue is modeled as a loop where the phonological store hears the inner voice produced by the hidden articulator process. A central executive module drives the whole system, and contributes to the generation of conscious thoughts by retrieving information from long-term memory. The surface form of thoughts thus emerges by …
Smart Phone, Smart Science: How the Use of Smartphones Can Revolutionize Research in Cognitive Science
2011
WOS:000295936900019; International audience; Investigating human cognitive faculties such as language, attention, and memory most often relies on testing small and homogeneous groups of volunteers coming to research facilities where they are asked to participate in behavioral experiments. We show that this limitation and sampling bias can be overcome by using smartphone technology to collect data in cognitive science experiments from thousands of subjects from all over the world. This mass coordinated use of smartphones creates a novel and powerful scientific "instrument" that yields the data necessary to test universal theories of cognition. This increase in power represents a potential re…
Three-dimensional interpretation of the color system of Aguilonius/Rubens 1613
2000
The two-dimensional color system in the textbook on optics, written by F. Aguilonius (1613) and illustrated by PP Rubens,1 is equivalent to a three-dimensional color solid, which can also be constructed by applying the trichromatic theory of color vision on a color circle. © 2000 John Wiley & Sons, Inc. Col Res Appl, 26, S17–S19, 2001
Analytic extension of non quasi-analytic Whitney jets of Roumieu type
1997
Let (Mr)r∈ℕ0 be a logarithmically convex sequence of positive numbers which verifies M0 = 1 as well as Mr≥ 1 for every r ∈ ℕ and defines a non quasi-analytic class. Let moreover F be a closed proper subset of ℝn. Then for every function ƒ on ℝn belonging to the non quasi-analytic (Mr)-class of Roumieu type, there is an element g of the same class which is analytic on ℝnF and such that Dα ƒ(x) = Dαg(x) for every σ ∈ ƒ0n SBAP and x ∈ F.
A NOTE ON THE ASYMPTOTIC PROBABILITIES OF EXISTENTIAL SECOND-ORDER MINIMAL GÖDEL SENTENCES WITH EQUALITY
1995
The minimal Gödel class is the class of first-order prenex sentences whose quantifier prefix consists of two universal quantifiers followed by just one existential quantifier. We prove that asymptotic probabilities of existential second-order sentences, whose first-order part is in the minimal Gödel class, form a dense subset of the unit interval.
On finding common neighborhoods in massive graphs
2003
AbstractWe consider the problem of finding pairs of vertices that share large common neighborhoods in massive graphs. We prove lower bounds on the resources needed to solve this problem on resource-bounded models of computation. In streaming models, in which algorithms can access the input only a constant number of times and only sequentially, we show that, even with randomization, any algorithm that determines if there exists any pair of vertices with a large common neighborhood must essentially store and process the input graph off line. In sampling models, in which algorithms can only query an oracle for the common neighborhoods of specified vertex pairs, we show that any algorithm must …